Transa tions and Zero-Safe Nets

An Equational Theory for Transa tions ?

Process Migration and Transactions Using a Novel Intermediate Language

Pro ess migration and atomi transa tions are essential tools for onstru ting fault-tolerant distributed systems. We present a new system that in ludes a typed intermediate language and runtime implementation designed to support these servi es. The language is type-safe and general enough to support front-ends for both type-safe and unsafe languages. We in lude ben hmarks for programs written in...

Zero-safe nets: The individual token approach

In this paper we provide both an operational and an abstract concurrent semantics for zero-safe nets under the individual token philosophy. The main feature of zero-safe nets is a primitive notion of transition synchronization. Besides ordinary places, called stable places, zero-safe nets come equipped with zero places, which are empty in any stable marking. Connected transactions represent bas...

- Safe Nets , or Transition SynchronizationMade Simple 1

In addition to ordinary places, called stable, zero-safe nets are equipped with zero places, which in a stable marking cannot contain any token. An evolution between two stable markings, instead, can be a complex computation called stable transaction , which may use zero places, but which is atomic when seen from stable places: no stable token generated in a transaction can be reused in the sam...

- Safe Nets , or TransitionSynchronization Made

In addition to ordinary places, called stable, zero-safe nets are equipped with zero places, which in a stable marking cannot contain any token. An evolution between two stable markings, instead, can be a complex computation called stable transaction , which may use zero places, but which is atomic when seen from stable places: no stable token generated in a transaction can be reused in the sam...